Graphs Abhiram Ranade
نویسنده
چکیده
A graph is planar if it can be drawn in the plane without edges crossing. More formally, a graph is planar if it has an embedding in the plane, in which each vertex is mapped to a distinct point P (v), and edge (u; v) to simple curves connecting P (u); P (v), such that curves intersect only at their endpoints. Examples of planar graphs: Pn, Trees, Cycles, X-tree, K4. Examples of non-planar graphs: Qn for n>3, K5, K3;3, the complete bipartite graph which each partition having 3 vertices. An important notion for planar graphs is that of a Face: which is simply a region of the plane bounded by edges of the graph. The outer in nite region is also considered a face. Planar graphs are important for several reasons. First, they are very closely linked to the early history of graph theory. Second, in the mechanical analysis of two dimensional structures, the structures get partitioned and these partitions can be represented using planar graphs. Planar graphs are also interesting because they are a large class of graphs having small separators. After studying some basic notions, we will study the colouring and separation of planar graphs.
منابع مشابه
Cs 408 Planar Graphs Abhiram Ranade
A graph is planar if it can be drawn in the plane without edges crossing. More formally, a graph is planar if it has an embedding in the plane, in which each vertex is mapped to a distinct point P (v), and edge (u, v) to simple curves connecting P (u), P (v), such that curves intersect only at their endpoints. Examples of planar graphs: Pn, Trees, Cycles, X-tree, K4. Examples of non-planar grap...
متن کاملSome uses of spectral methods
Methods based on the analysis of eigenvalues or singular values of a matrix, often called spectral methods are very popular for many applications including graph partitioning, clustering, recognition, compression. This paper will survey some of these applications and present the basic underlying ideas.
متن کاملComponent Coloring of Proper Interval Graphs and Split Graphs
We introduce a generalization of the well known graph (vertex) coloring problem, which we call the problem of component coloring of graphs. Given a graph, the problem is to color the vertices using the minimum number of colors so that the size of each connected component of the subgraph induced by the vertices of the same color does not exceed C. We give a linear time algorithm for the problem ...
متن کامل